Armand the Frog
نویسندگان
چکیده
منابع مشابه
Armand Leroi
widespread decisions, such as how a group of primates decide where to travel after a rest period or how a flock of birds decides when to leave a foraging patch. “Unless all members decide on the same action, some will be left behind and will forfeit, at least temporarily, the advantages of group living,” they write. “Thus, in order to maintain group cohesion, social animals — like humans — have...
متن کاملArmand Borel ( 1923 – 2003 )
The Swiss mathematician Armand Borel died August 11, 2003, in Princeton from a rapidly evolving cancer. Few foreign mathematicians had as many connections with France. He was a student of Leray, he took part in the Cartan seminar, and he published more than twenty papers in collaboration with our colleagues Lichnerowicz and Tits, as well as with me. He was a member of Bourbaki for more than twe...
متن کاملPhototactic Behavior of the Armand Pine Bark Weevil, Pissodes punctatus
The Armand pine bark weevil, Pissodes punctatus Langor et Zhang (Coleoptera: Curculionidae) is a destructive bark weevil on the Armand pine, Pinus armandii Franch (Pinales: Pinaceae), an important timbering tree in southern China. This study examined the phototactic behavior ïéP. punctatus through observation of behavioral characteristics, response to nine monochromatic lights (ranging from 340...
متن کاملProfessor Armand Trousseau (1801-67) and the treatment of rickets.
Armand Trousseau was born in Tours in 1801. He was a pupil of Pierre Fidèle Bretonneau (1778–1862) in Tours before graduating in Paris in 1825. He became agrégé (qualified) in 1826 and made his early reputation on yellow fever and laryngeal phthisis. The first to undertake tracheotomy in 1831, he popularised this intervention in the treatment of croup, usually due to diphtheria; he had a 25% su...
متن کاملUse of the Improved Frog-Leaping Algorithm in Data Clustering
Clustering is one of the known techniques in the field of data mining where data with similar properties is within the set of categories. K-means algorithm is one the simplest clustering algorithms which have disadvantages sensitive to initial values of the clusters and converging to the local optimum. In recent years, several algorithms are provided based on evolutionary algorithms for cluster...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Iowa Review
سال: 1994
ISSN: 0021-065X,2330-0361
DOI: 10.17077/0021-065x.4705